dynamic scheduling

См. также в других словарях:

• dynamic scheduling — dinaminis planavimas statusas T sritis automatika atitikmenys: angl. dynamic scheduling vok. dynamische Planung, f rus. динамическое планирование, n pranc. planification dynamique, f …   Automatikos terminų žodynas

• dynamic scheduling —    In computerized communications systems, the decision concerning which program to execute next is made by the computer from moment to moment, depending on events taking place. In conventional batch applications, the computer has a fixed… …   IT glossary of terms, acronyms and abbreviations

• Dynamic priority scheduling — is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of dynamic priority scheduling is to adapt to dynamically changing progress and form an optimal configuration in self sustained… …   Wikipedia

• Dynamic single-frequency networks — (DSFN) is a transmitter macrodiversity technique for OFDM based cellular networks. DSFN is based on the idea of single frequency networks (SFN), which is a group of radio transmitters that send the same signal simultaneously over the same… …   Wikipedia

• Dynamic random access memory — (DRAM) is a type of random access memory that stores each bit of data in a separate capacitor within an integrated circuit. Since real capacitors leak charge, the information eventually fades unless the capacitor charge is refreshed periodically …   Wikipedia

• Scheduling algorithm — In computer science, a scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or …   Wikipedia

• Dynamic random-access memory — DRAM redirects here. For other uses, see Dram (disambiguation). Computer memory types Volatile RAM DRAM (e.g., DDR SDRAM) SRAM In development T RAM Z RAM TTRAM Historical Delay line memory Selectron tube Williams tube …   Wikipedia

• Dynamic Analysis and Replanning Tool — The Dynamic Analysis and Replanning Tool, commonly abbreviated to DART, is an artificial intelligence program[1] used by the U.S. military to optimize and schedule the transportation of supplies or personnel and solve other logistical problems.… …   Wikipedia

• Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

• Loop scheduling — In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load balancing and maintain data locality with minimum dispatch overhead.Typical loop scheduling methods… …   Wikipedia

• Earliest deadline first scheduling — Earliest deadline first (EDF) scheduling is a dynamic scheduling algorithm used in real time operating systems. It places processes in a priority queue. Whenever a scheduling event occurs (task finishes, new task released, etc.) the queue will be …   Wikipedia